A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
نویسندگان
چکیده
We present the first combinatorial polynomial time algorithm for computing the equilibrium of the Arrow-Debreu market model with linear utilities. Our algorithm views the allocation of money as flows and iteratively improves the balanced flow as in [Devanur et al. 2008] for Fisher’s model. We develop new methods to carefully deal with the flows and surpluses A preliminary version of this paper was presented at ICALP 2013. Max-Planck-Institut für Informatik, Saarbrücken, Germany, [email protected] Max-Planck-Institut für Informatik, Saarbrücken, Germany, [email protected]
منابع مشابه
An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
We present an improved combinatorial algorithm for the computation of equilibrium prices in the linear ArrowDebreu model. For a market with n agents and integral utilities bounded by U , the algorithm runs in O(n log(nU)) time. This improves upon the previously best algorithm of Ye by a factor of Ω̃(n). The algorithm refines the algorithm described by Duan and Mehlhorn and improves it by a facto...
متن کاملAn Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. Their running time depended on the size of the numbers representing the utilities and endowments of the buyers. In this paper, we give a strongly polynomial time approximation scheme for this problem. Our algorithm build...
متن کاملNash Bargaining Via Flexible Budget Markets
We initiate a study of Nash bargaining games [Nas50] via combinatorial, polynomial time algorithms and we carry this program over to solving nonsymmetric bargaining games of Kalai [Kal77] as well. Since the solution to a Nash bargaining game is also the optimal solution to the corresponding convex program, this involves obtaining a combinatorial algorithm for the latter. This in turn can be vie...
متن کاملRational Convex Programs, Their Feasibility, and the Arrow-Debreu Nash Bargaining Game
Over the last decade, combinatorial algorithms have been obtained for exactly solving several nonlinear convex programs. We first provide a formal context to this activity by introducing the notion of rational convex programs – this also enables us to identify a number of questions for further study. So far, such algorithms were obtained for total problems only. Our main contribution is develop...
متن کاملA Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities
Using Lemke’s scheme, we give a complementary pivot algorithm for computing an equilibrium for Arrow-Debreu markets under separable, piecewise-linear concave (SPLC) utilities. Despite the PPAD-completeness of this case, experiments indicate that our algorithm is practical – on randomly generated instances, the number of iterations it needs is linear in the total number of segments (i.e., pieces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013